Differential Games Controllers That Confine a System to a Safe Region in the State Space, With Applications to Surge Tank Control

Surge tanks are units employed in chemical processing to regulate the flow of fluids between reactors. A notable feature of surge tank control is the need to constrain the magnitude of the Maximum Rate of Change (MROC) of the surge tank outflow, since excessive fluctuations in the rate of change of outflow can adversely affect down-stream processing (through disturbance of sediments, initiation of turbulence, etc.). Proportional + Integral controllers, traditionally employed in surge tank control, do not take direct account of the MROC. It is therefore of interest to explore alternative approaches. We show that the surge tank controller design problem naturally fits a differential games framework, proposed by Dupuis and McEneaney, for controlling a system to confine the state to a safe region of the state space. We show furthermore that the differential game arising in this way can be solved by decomposing it into a collection of (one player) optimal control problems. We discuss the implications of this decomposition technique, for the solution of other controller design problems possessing some features of the surge tank controller design problem

Model predictive Control: a passive scheme

© IFAC.This note studies the formulation of model predictive control exploiting passivity properties. The introduction of passive constraints in model predictive control schemes is particularly appealing since robustness against model uncertainty is inherently guaranteed. The potential of the discussed control scheme is shown on the regulation problem of a robot manipulator

Automatic scenario generation for efficient solution of robust optimal control problems

Existing methods for nonlinear robust control often use scenario-based approaches to formulate the control problem as large nonlinear optimization problems. The optimization problems are challenging to solve due to their size, especially if the control problems include time-varying uncertainty. This paper draws from local reduction methods used in semi-infinite optimization to solve robust optimal control problems with parametric and time-varying uncertainty. By iteratively adding interim worst-case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. We show that the local reduction method for optimal control problems consists of solving a series of simplified optimal control problems to find worst-case constraint violations. In particular, we present examples where local reduction methods find worst-case scenarios that are not on the boundary of the uncertainty set. We also provide bounds on the error if local solvers are used. The proposed approach is illustrated with two case studies with parametric and additive time-varying uncertainty. In the first case study, the number of scenarios obtained from local reduction is 101, smaller than in the case when all 2¹⁴⁺³×¹⁹² extreme scenarios are considered. In the second case study, the number of scenarios obtained from the local reduction is two compared to 512 extreme scenarios. Our approach was able to satisfy the constraints both for parametric uncertainty and time-varying disturbances, whereas approaches from literature either violated the constraints or became computationally expensive

Application of energy storage in systems with high penetration of intermittent renewables

Nowadays, in Uruguay, a considerable amount of energy produced by renewable resources is curtailed inducing frequent substantial reductions in the spot market prices. This paper analyses the incorporation of energy storage into the Uruguayan network, taking the different perspectives of a private investor and a central planner. From the investor point of view, we investigate the option of doing energy arbitrage in the wholesale market, taking advantage of the spot price fluctuations. From the national perspective, we develop an optimal power flow planning model to perform a cost-benefit analysis of batteries’ integration in reducing thermal generation. We conclude that, from a private investor perspective, fluctuations in the spot prices are not enough to make investments in batteries profitable with current prices. On the other hand, from a national perspective, results are more promising, obtaining very high revenues in some case studies

Automatic scenario generation for efficient solution of robust optimal control problems

Existing methods for nonlinear robust control often use scenario-based approaches to formulate the control problem as large nonlinear optimization problems. The optimization problems are challenging to solve due to their size, especially if the control problems include time-varying uncertainty. This paper draws from local reduction methods used in semi-infinite optimization to solve robust optimal control problems with parametric and time-varying uncertainty. By iteratively adding interim worst-case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. We show that the local reduction method for optimal control problems consists of solving a series of simplified optimal control problems to find worst-case constraint violations. In particular, we present examples where local reduction methods find worst-case scenarios that are not on the boundary of the uncertainty set. We also provide bounds on the error if local solvers are used. The proposed approach is illustrated with two case studies with parametric and additive time-varying uncertainty. In the first case study, the number of scenarios obtained from local reduction is 101, smaller than in the case when all 2¹⁴+³ₓ¹⁹² extreme scenarios are considered. In the second case study, the number of scenarios obtained from the local reduction is two compared to 512 extreme scenarios. Our approach was able to satisfy the constraints both for parametric uncertainty and time-varying disturbances, whereas approaches from literature either violated the constraints or became computationally expensive

Automatic Scenario Generation for Robust Optimal Control Problems

Existing methods for nonlinear robust control often use scenario-based approaches to formulate the control problem as nonlinear optimization problems. Increasing the number of scenarios improves robustness while increasing the size of the optimization problems. Mitigating the size of the problem by reducing the number of scenarios requires knowledge about how the uncertainty affects the system. This paper draws from local reduction methods used in semi-infinite optimization to solve robust optimal control problems with parametric uncertainty. We show that nonlinear robust optimal control problems are equivalent to semi-infinite optimization problems and can be solved by local reduction. By iteratively adding interim globally worst-case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. In particular, we show that local reduction methods find worst-case scenarios that are not on the boundary of the uncertainty set. The proposed approach is illustrated with a case study with both parametric and additive time-varying uncertainty. The number of scenarios obtained from local reduction is 101, smaller than in the case when all 2 14+3×192 boundary scenarios are considered. A validation with randomly-drawn scenarios shows that our proposed approach reduces the number of scenarios and ensures robustness even if local solvers are used

Robust and automatic data cleansing method for short-term load forecasting of distribution feeders

Distribution networks are undergoing fundamental changes at medium voltage level. To support growing planning and control decision-making, the need for large numbers of short-term load forecasts has emerged. Data-driven modelling of medium voltage feeders can be affected by (1) data quality issues, namely, large gross errors and missing observations (2) the presence of structural breaks in the data due to occasional network reconfiguration and load transfers. The present work investigates and reports on the effects of advanced data cleansing techniques on forecast accuracy. A hybrid framework to detect and remove outliers in large datasets is proposed; this automatic procedure combines the Tukey labelling rule and the binary segmentation algorithm to cleanse data more efficiently, it is fast and easy to implement. Various approaches for missing value imputation are investigated, including unconditional mean, Hot Deck via k-nearest neighbour and Kalman smoothing. A combination of the automatic detection/removal of outliers and the imputation methods mentioned above are implemented to cleanse time series of 342 medium-voltage feeders. A nested rolling-origin-validation technique is used to evaluate the feed-forward deep neural network models. The proposed data cleansing framework efficiently removes outliers from the data, and the accuracy of forecasts is improved. It is found that Hot Deck (k-NN) imputation performs best in balancing the bias-variance trade-off for short-term forecasting

Data-Driven Predictive Control With Improved Performance Using Segmented Trajectories

A class of data-driven control methods has recently emerged based on Willems’ fundamental lemma. Such methods can ease the modeling burden in control design but can be sensitive to disturbances acting on the system under control. In this article, we propose a restructuring of the problem to incorporate segmented prediction trajectories. The proposed segmentation leads to reduced tracking error for longer prediction horizons in the presence of unmeasured disturbance and noise when compared with an unsegmented formulation. The performance characteristics are illustrated in a set-point tracking case study in which the segmented formulation enables more consistent performance over a wide range of prediction horizons. The method is then applied to a building energy management problem using a detailed simulation environment. The case studies show that good tracking performance is achieved for a range of horizon choices, whereas performance degrades with longer horizons without segmentation

Data-driven predictive control with reduced computational effort and improved performance using segmented trajectories

A class of data-driven control methods has recently emerged based on Willems' fundamental lemma. Such methods can ease the modelling burden in control design but can be sensitive to disturbances acting on the system under control. In this paper, we extend these methods to incorporate segmented prediction trajectories. The proposed segmentation enables longer prediction horizons to be used in the presence of unmeasured disturbance. Furthermore, a computation time reduction can be achieved through segmentation by exploiting the problem structure, with computation time scaling linearly with increasing horizon length. The performance characteristics are illustrated in a set-point tracking case study in which the segmented formulation enables more consistent performance over a wide range of prediction horizons. The computation time for the segmented formulation is approximately half that of an unsegmented formulation for a horizon of 100 samples. The method is then applied to a building energy management problem, using a detailed simulation environment, in which we seek to minimise the discomfort and energy of a 6-room apartment. With the segmented formulation, a 72% reduction in discomfort and 5% financial cost reduction is achieved, compared to an unsegmented formulation using a one-day-ahead prediction horizon

Predictive control co-design for enhancing flexibility in residential housing with battery degradation

Buildings are responsible for about a quarter of global energy-related CO2 emissions. Consequently, the decarbonisation of the housing stock is essential in achieving net-zero carbon emissions. Global decarbonisation targets can be achieved through increased efficiency in using energy generated by intermittent resources. The paper presents a co-design framework for simultaneous optimal design and operation of residential buildings using Model Predictive Control (MPC). The framework is capable of explicitly taking into account operational constraints and pushing the system to its efficiency and performance limits in an integrated fashion. The optimality criterion minimises system cost considering time-varying electricity prices and battery degradation. A case study illustrates the potential of co-design in enhancing flexibility and self-sufficiency of a system operating under different conditions. Specifically, numerical results from a low-fidelity model show substantial carbon emission reduction and bill savings compared to an a-priori sizing approach